/*
 *  Copyright CSCS 2012
 *
 *  Licensed under the Apache License, Version 2.0 (the "License");
 *  you may not use this file except in compliance with the License.
 *  You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 *  Unless required by applicable law or agreed to in writing, software
 *  distributed under the License is distributed on an "AS IS" BASIS,
 *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 *  See the License for the specific language governing permissions and
 *  limitations under the License.
 */

/*! \file maximal_independent_set.h
 *  \brief Maximal independent set of a graph
 */

#pragma once

#include <cusp/detail/config.h>

namespace cusp
{
namespace graph
{
/*! \addtogroup algorithms Algorithms
 *  \ingroup algorithms
 *  \{
 */

/*! \p neighborhood_extension : from an input matrix, computes a matrix 
 * in which has the sparsity pattern is extended to the neighbors of
 * any given graph vertex, to the neighbors of those neighbors, and so
 * on, to the a given neighborhood level.  level = 0 defines the same 
 * matrix as on input.
 * pattern 
 *
 * \param A matrix that represents a graph (need not be symmetric)
 * \param level neighborhood level
 *
 * \tparam MatrixType matrix type
 *
 */

//template <typename ValueType, typename MemorySpace>
//class diagonal : public linear_operator<ValueType, MemorySpace>
//{
  //    typedef linear_operator<ValueType, MemorySpace> Parent;


  // public:

template <typename MatrixType>
 MatrixType neighborhood_extension(const MatrixType& A, size_t level);

/*! \}
 */
// };

} // end namespace graph
} // end namespace cusp

#include <cusp/graph/detail/neighborhood_extension.inl>

